Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/d8/dee/avltree_8cpp_source.html below:

TheAlgorithms/C++: data_structures/avltree.cpp Source File

(root ==

) {

1 + std::max(

(root->left),

(root->right));

*t = root->right;

(root->left ==

) {

(root ==

) {

(item < root->

) {

root->left =

(root->left, item);

root->right =

(root->right, item);

(root ==

) {

(element < root->

) {

root->left =

(root->left, element);

}

(element > root->data) {

root->right =

(root->right, element);

(!root->right || !root->left) {

*temp = !root->right ? root->left : root->right;

root->data = temp->data;

root->right =

(root->right, temp->data);

std::queue<node *> q;

std::cout << root->data <<

;

*root =

;

(i = 1; i <= 7; i++) root =

(root, i);

std::cout <<

;

std::cout <<

;

std::cout <<

;

node * insert(node *root, int item)

inserts a new element into AVL tree

node * leftRotate(node *root)

node * createNode(int data)

creates and returns a new node

node * minValue(node *root)

struct node { int data; int height; struct node *left; struct node *right;} node

for std::queue

void deleteAllNodes(const node *const root)

calls delete on every node

node * deleteNode(node *root, int element)

removes a given element from AVL tree

int getBalance(node *root)

node * rightRotate(node *root)

void levelOrder(node *root)

prints given tree in the LevelOrder

int main()

Main function.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4