"Data structure" create two fork Tree

Source: Internet
Author: User

The input node is worth paying attention to!!!

To follow abc# #de #g# #f # # #的格式输入.

/* Two fork Tree 
#include <stdio.h>

//Use two-fork list to store binary tree 
typedef struct bitnode{
	char data;
	struct Bitnode *lchild,*rchild;
} Bitnode,*bitree;

Sequence of sequential resumes binary linked list 
void Createbitree (Bitree &t) {
	//Enter binary tree node values in order of First order
	Char ch;
	scanf ("%c", &ch);
	if (ch== ' # ') {
	} else{
		t=new Bitnode;
		Createbitree (t->lchild);
		Createbitree (T->rchild);

void Inordertraverse (Bitree t) {
	if (t) {
		inordertraverse (t->lchild);
		printf ("%c", t->data);
		Inordertraverse (T->rchild);

int main () {
	bitree T;
	Createbitree (T);
	Inordertraverse (T);

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.