Breaking News: Grepper is joining You.com. Read the official announcement!

Binary Tree Array C++

Saran Kaewchuay answered on November 13, 2022 Popularity 5/10 Helpfulness 2/10

answer Binary Tree Array C++

related Binary Tree Array

Binary Tree Array C++

Comment

// C++ implementation of tree using array
// numbering starting from 0 to n-1.
#include<bits/stdc++.h>
using namespace std;
char tree[10];
int root(char key) {
if (tree[0] != '\0')
	cout << "Tree already had root";
else
	tree[0] = key;
return 0;
}

int set_left(char key, int parent) {
if (tree[parent] == '\0')
	cout << "\nCan't set child at "
	<< (parent * 2) + 1
	<< " , no parent found";
else
	tree[(parent * 2) + 1] = key;
return 0;
}

int set_right(char key, int parent) {
if (tree[parent] == '\0')
	cout << "\nCan't set child at "
	<< (parent * 2) + 2
	<< " , no parent found";
else
	tree[(parent * 2) + 2] = key;
return 0;
}

int print_tree() {
cout << "\n";
for (int i = 0; i < 10; i++) {
	if (tree[i] != '\0')
	cout << tree[i];
	else
	cout << "-";
}
return 0;
}

// Driver Code
int main() {
root('A');
set_left('B',0);
set_right('C', 0);
set_left('D', 1);
set_right('E', 1);
set_right('F', 2);
print_tree();
return 0;
}

Popularity 5/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: binary-tree c++

Link to this answer
Share Copy Link

Contributed on Nov 13 2022

Saran Kaewchuay

0 Answers Avg Quality 2/10

Closely Related Answers

Binary Tree Array

Comment

# Python3 implementation of tree using array
# numbering starting from 0 to n-1.
tree = [None] * 10
 
 
def root(key):
    if tree[0] != None:
        print("Tree already had root")
    else:
        tree[0] = key
 
 
def set_left(key, parent):
    if tree[parent] == None:
        print("Can't set child at", (parent * 2) + 1, ", no parent found")
    else:
        tree[(parent * 2) + 1] = key
 
 
def set_right(key, parent):
    if tree[parent] == None:
        print("Can't set child at", (parent * 2) + 2, ", no parent found")
    else:
        tree[(parent * 2) + 2] = key
 
 
def print_tree():
    for i in range(10):
        if tree[i] != None:
            print(tree[i], end="")
        else:
            print("-", end="")
    print()
 
 
# Driver Code
root('A')
set_right('C', 0)
set_left('D', 1)
set_right('E', 1)
set_right('F', 2)
print_tree()
 
# This code is contributed by Gaurav Kumar Tailor

Popularity 8/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: whatever binary-tree what

Link to this answer
Share Copy Link

Contributed on Nov 13 2022

Saran Kaewchuay

0 Answers Avg Quality 2/10

Binary Tree Array C++

Contents

More Related Answers

Binary Tree Array C++

Closely Related Answers

Binary Tree Array

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.