Scribd Logo
Upload

Welcome to Scribd!

  • Parcurgere Arbori

    Uploaded by

    Voicu Cristian Valentin
    47 views1 page
    This document defines functions for traversing a binary tree structure in different orders - in-order, pre-order, and post-order. It defines a node structure with left and right child pointers, reads in a binary tree, and calls functions to traverse and output the nodes in each order.

    Original Description:

    Original Title

    parcurgere arbori

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document defines functions for traversing a binary tree structure in different orders - in-order, pre-order, and post-order. It defines a node structure with left and right child pointers, reads in a binary tree, and calls functions to traverse and output the nodes in each order.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    47 views1 page

    Parcurgere Arbori

    Uploaded by

    Voicu Cristian Valentin
    This document defines functions for traversing a binary tree structure in different orders - in-order, pre-order, and post-order. It defines a node structure with left and right child pointers, reads in a binary tree, and calls functions to traverse and output the nodes in each order.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    #include<iostream.h> #include<conio.

    h> struct nod{int nro; nod*st,*dr;}; nod *r; void svd(nod *c) {if(c) {svd(c->st); cout<<c->nro<<" "; svd(c->dr); } } void vsd(nod *c) {if(c) {cout<<c->nro<<" "; vsd(c->st); vsd(c->dr); } } void sdv(nod *c) {if(c) {sdv(c->st); sdv(c->dr); cout<<c->nro<<" "; } } nod* citire_h() {int nr; nod*c; cout<<"nr de ordine "; cin>>nr; if(nr) {c=new nod; c->nro=nr; c->st=citire_h(); c->dr=citire_h(); return c; } else return 0; } void main() {clrscr(); r=citire_h(); cout<<endl<<"parcurgere svd - in inordine "<<endl; svd(r); cout<<endl<<"parcurgere vsd - in preordine "<<endl; vsd(r); cout<<endl<<"parcurgere sdv - in postordine "<<endl; sdv(r); getch();

    You might also like