二叉树打印叶子节点,非递归

Solution:

解：

Input: A singly linked list whose address of the first node is stored in a pointer, say head

输入：一个单链表 ，其第一个节点的地址存储在指针中，例如head

Output: The alternative nodes in the list

输出：列表中的备用节点

Data structure used: Singly linked list where each node contains a data element say data, and the address of the immediate next node say next, with Head holding the address of the first node.

所使用的数据结构：单链列表，其中每个节点包含一个数据元素，例如data ，直接下一个节点的地址说next ，其中Head保留第一个节点的地址。

Recursive function to print alternative nodes (Pseudocode):

递归函数以打印备用节点(伪代码)：

Function alternate_display(temp):
Begin
IF(temp!=NULL){
Print "temp->data"
If(temp->next==NULL)
temp=NULL;
Else
alternate_display(temp->next->next);
}
Else
return control to the main function
End IF-ELSE
End FUNCTION

C Implementation:

C实现：

#include <stdio.h>
#include <stdlib.h>
typedef struct list //node structure
{
int data;
struct list *next;
}node;
//recursive function
void alternatedisp(node *temp); 
int main(){
node *head=NULL,*temp,*temp1;
int choice,count=0,key;
//Taking the linked list as input
do
{
temp=(node *)malloc(sizeof(node));
if(temp!=NULL)
{
printf("\nEnter the element in the list : ");
scanf("%d",&temp->data);
temp->next=NULL;
if(head==NULL)
{	
head=temp;
}
else
{
temp1=head;
while(temp1->next!=NULL)
{
temp1=temp1->next;
}
temp1->next=temp;
}
}
else
{
printf("\nMemory not avilable...node allocation is not possible");
}
printf("\nIf you wish to add m ore data on the list enter 1 : ");
scanf("%d",&choice);
}while(choice==1);
//Now displaying the alternative nodes starting from the begining
printf("\nDisplaying the alternative items of the list starting from the begining : \n");
alternatedisp(head);
printf("NULL\n");
return 0;
}
//recursive function to display alternative nodes
void alternatedisp(node *temp) 
{
if(temp!=NULL)
{
printf("%d->",temp->data);
if(temp->next==NULL)	
temp=NULL;
else
alternatedisp(temp->next->next);
}
else
return;
}

Output

输出量

Enter the element in the list : 7
If you wish to add m ore data on the list enter 1 : 1
Enter the element in the list : 6
If you wish to add m ore data on the list enter 1 : 1
Enter the element in the list : 5
If you wish to add m ore data on the list enter 1 : 1
Enter the element in the list : 4 
If you wish to add m ore data on the list enter 1 : 1
Enter the element in the list : 3
If you wish to add m ore data on the list enter 1 : 0
Displaying the alternative items of the list starting from the begining :
7->5->3->NULL

翻译自: https://www.includehelp.com/c-programs/print-the-alternate-nodes-in-a-linked-list-using-recursion.aspx

二叉树打印叶子节点,非递归