Preorder traversal binary tree

From , 3 Years ago, written in C, viewed 247 times.

void PreOrder（BiTree bt）
{/*先序遍历二叉树bt*/
    if ( bt==NULL ) return; /*递归调用的结束条件*/
    Visite（bt->data）; /*访问结点的数据域*/
    PreOrder（bt->lchild）; /*先序递归遍历bt 的左子树*/
    PreOrder（bt->rchild）; /*先序递归遍历bt 的右子树*/
}
 
 

Reply to "Preorder traversal binary tree"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters

https://burned.cc - Burn After Reading Website

Pastebin.vip

Preorder traversal binary tree

Reply to "Preorder traversal binary tree"